Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics

نویسندگان

  • Maciej Gazda
  • Wan Fokkink
چکیده

One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition system specifications that define process algebras. In this paper we suggest a novel, orthogonal approach. Namely, we focus on a number of process operators, and for each of them attempt to find the widest possible class of congruences. To this end, we impose restrictions on sublanguages of Hennessy-Milner logic, so that a semantics whose modal characterization satisfies a given criterion is guaranteed to be a congruence with respect to the operator in question. We investigate action prefix, alternative composition, two restriction operators, and parallel composition.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositionality of Approximate Bisimulation for Probabilistic Systems

Probabilistic transition system specifications using the rule format ntμfθ/ntμxθ provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respec...

متن کامل

A Pre-congruence Format for XY-simulation

XY -simulation is a generalization of bisimulation that is parameterized with two subsets of actions. XY -simulation is known in the literature under different names such as modal refinement, partial bisimulation, and alternating simulation. In this paper, we propose a precongruence rule format for XY -simulation. The format allows for checking compositionality of XY -simulation for an arbitrar...

متن کامل

Bialgebraic methods and modal logic in structural operational semantics

Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this paper, bialgebraic semantics is c...

متن کامل

Semantic-Driven Emergence of Syntax : The Principle of Compositionality upside-down

In Chomskyan views of linguistics, syntax is a preeminent independent level whose knowledge is mainly innate. Semantics is then usually seen as a secondary structure deduced from the syntactic analysis. The Principle of Compositionality is, in this context, a precise way of specifying the passage from syntax to semantics. But from an emergence perspective, this conception is very awkward. As a ...

متن کامل

On the Compositionality and Analysis

This work discusses three aspects of net theory: compositionality of nets, analysis of nets and high-level nets. Net theory has often been criticised for the diiculty of giving a compositional semantics to a net. In this work we discuss this problem form a category theoretic point of view. In category theory compositionality is represented by colimits. We show how a high-level net can be mapped...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010